A HARD REAL-TIME SCHEDULER ALGORITHM FOR SOLID STATE DEVICE
نویسندگان
چکیده
منابع مشابه
Designing a Fuzzy Scheduler for Hard Real-Time Systems
In hard real-time systems, tasks have to be performed not only correctly, but also in a timely fashion. If timing constraints are not met, there might be severe consequences. Task scheduling is the most important problem in designing a hard real-time system, because the scheduling algorithm ensures that tasks meet their deadlines. However, the inherit nature of uncertainty in dynamic hard real-...
متن کاملAdaptable Scheduler Using Milestones For Hard Real-Time Systems
Issues for designing adaptable hard real-time scheduler are discussed. A general approach that utilises milestones is given and illustrated using the Least Laxity Algorithm. The hard real-time tasks are guaranteed by means of an "alert" that is generated using the information provided by the milestones. Some performance results are also given (in the form of upper bound of the overhead). hhhhhh...
متن کاملA Real Time Scheduler/Dispatcher
Real-time systems often spend an inordinate amount of time getting ready to do things in the future and deciding what to do next. Designating a task to be performed at some time in the future, or scheduling, and nding the next task to be run, or dispatching, typically take a total time which is linear in the number of waiting tasks. A new algorithm is presented in which the time for both schedu...
متن کاملAn Efficient Energy-Optimal Device-Scheduling Algorithm for Hard Real-Time Systems
Dynamic Power Management (DPM) aims at minimizing energy consumption in batterypowered electronics such as mobile and embedded systems. An interesting problem under DPM is energy-optimal device scheduling that tries to minimize device energy consumption for a given task set. In this paper, we present an improved version of Energy-optimal Device Scheduler (EDS), an algorithm originally proposed ...
متن کاملReal-time Priority Scheduler
The Real-time Priority Scheduler architectural pattern concerns real-time systems and introduces several scheduling classes representing different criticality levels for all activities of modern real-time applications. Scheduling is done according to the activities’ priorities and scheduling policies having to guarantee the execution of the most critical activities first and some fairness crite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electronics Signals and Systems
سال: 2012
ISSN: 2231-5969
DOI: 10.47893/ijess.2012.1079